Smooth Bi-3 spline surfaces with fewest knots

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smooth Bi-3 spline surfaces with fewest knots

Converting a quadrilateral input mesh into a C surface with one bi-3 tensorproduct spline patch per facet is a classical challenge. We give explicit local averaging formulas for the spline control points. Where the quadrilateral mesh is not regular, the patches have two internal double knots, the least number and multiplicity to always allow for an unbiased G construction.

متن کامل

Minimal bi-6 G2 completion of bicubic spline surfaces

This paper addresses a gap in the arsenal of curvature continuous tensor-product spline constructions: an algorithm is provided to fill n-sided holes in C bi-3 spline surfaces using n patches of degree bi-6. Numerous experiments illustrate good highlight line and curvature distribution on the resulting surfaces.

متن کامل

On the complexity of smooth spline surfaces from quad meshes

This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the choice of reparameterizations for geometric continuity. In particular, when one bicubic tensor-product B-spline patch is associated with each facet of a quadrilateral mesh with n-valent vertices and we do not want seg...

متن کامل

Spline surfaces with T-junctions

This paper develops a new way to create smooth piecewise polynomial free-form spline surfaces from quadmeshes that include T-junctions, where surface strips start or terminate. All mesh nodes can be interpreted as control points of geometrically-smooth, piecewise polynomials that we call GT-splines. GT-splines are B-spline-like and cover T-junctions by two or four patches of degree bi-4. They c...

متن کامل

Inscribing Smooth Knots with Regular Polygons

A knot K : S → R is said to be inscribed by a regular n-gon if there is a set of points x0, ..., xn−1 lying on K in a cyclic order, such that the distances ‖xi−1 − xi‖ between xi−1 and xi are the same for i = 1, ..., n, where xn = x0. Jon Simon asked the question of whether every smooth knot K is inscribed by a regular n-gon for all n. Up to rescaling we may assume that the length of K is 1. It...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer-Aided Design

سال: 2011

ISSN: 0010-4485

DOI: 10.1016/j.cad.2010.11.002